Efficient Open Domination in Digraph Products
نویسندگان
چکیده
منابع مشابه
Efficient open domination in graph products
A graph G is an efficient open domination graph if there exists a subset D of V (G) for which the open neighborhoods centered in vertices of D form a partition of V (G). We completely describe efficient domination graphs among direct, lexicographic and strong products of graphs. For the Cartesian product we give a characterization when one factor is K2 and some partial results for grids, cylind...
متن کاملEfficient open domination in digraphs
Let G be a digraph. A set S ⊆ V (G) is called an efficient total dominating set if the set of open out-neighborhoods N−(v) ∈ S is a partition of V (G). We say that G is efficiently open-dominated if both G and its reverse digraph G− have an efficient total dominating set. Some properties of efficiently open dominated digraphs are presented. Special attention is given to tournaments and directed...
متن کاملThe Roman Domination Number of a Digraph
LetD = (V,A) be a finite and simple digraph. A Roman dominating function (RDF) on a digraph D is a labeling f : V (D) → {0, 1, 2} such that every vertex with label 0 has a in-neighbor with label 2. The weight of an RDF f is the value ω(f) = ∑ v∈V f(v). The Roman domination number of a digraph D, denoted by γR(D), equals the minimum weight of an RDF on D. In this paper we present some sharp boun...
متن کاملIndependent restricted domination and the line digraph
Let H be a digraph possibly with loops and let D be a digraph whose arcs are colored with the vertices of H (an H-colored digraph). A walk (path) P in D will be called an H-restricted walk (path) if the colors displayed on the arcs of P form a walk in H. An H-restricted kernel N is a set of vertices of D such that for every two different vertices in N there is no H-restricted path in D joining ...
متن کاملThe Rainbow Domination Number of a Digraph
Let D = (V,A) be a finite and simple digraph. A II-rainbow dominating function (2RDF) of a digraph D is a function f from the vertex set V to the set of all subsets of the set {1, 2} such that for any vertex v ∈ V with f(v) = ∅ the condition ⋃ u∈N−(v) f(u) = {1, 2} is fulfilled, where N−(v) is the set of in-neighbors of v. The weight of a 2RDF f is the value ω(f) = ∑ v∈V |f(v)|. The 2-rainbow d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2020
ISSN: 2227-7390
DOI: 10.3390/math8040496